A Comparative Analysis of Radial-Tchebichef Moments and Zernike Moments
نویسنده
چکیده
moment descriptors are commonly used in applications such as image classification, pattern recognition and identification. A radial-polar representation of image coordinate space is particularly useful in the above applications, since it facilitates the derivation of rotation invariants of any arbitrary order. Zernike moments and radial-Tchebichef moments fall into the category of moments that are defined using radial-polar coordinates. The discrete orthogonal nature of the kernel of radial-Tchebichef moments provides notable advantages over continuous Zernike moments. The paper presents a detailed analysis to prove that radial-Tchebichef moments have superior features compared to Zernike moments and are computationally less complex. This paper also presents a novel framework for accurately computing moments with kernel defined using polar coordinates, that is particularly suitable for discrete orthogonal rotation invariants. The method preserves the separability property of the kernel, which can be effectively used in computing both forward and inverse moment transforms. Thus the proposed framework yields a simple and fast implementation of radial-Tchebichef moments for image reconstruction, and invariants for pattern recognition. The efficiency of the proposed method is demonstrated through a series of experimental results. The most appropriate mathematical structure for computing radial Tchebichef moments is a set of discrete concentric rings, where each ring represents a fixed integer value of radial distance r from the centre of the image. We can subdivide the coordinate space into /2 concentric rings Rr , r = 0,1,…,(/2)−1. Depending on the number of points inside a ring, each ring can be further subdivided into mr regions. An example for = 10 is shown in Figure 1. On ring Rr, the angle θ varies from 0 to 2π in mr discrete intervals such that θ k = r m k π 2 , k = 0, 1, 2,…, mr−1. (1) Eq. (1) is valid only under the assumption that there exists a one-to-one mapping between pixels on the image, and points that are distributed uniformly around concentric circles. If we denote the image intensity value at location (r, θk) by f(r, k), then the radial-Tchebichef moments of order p and repetition q are defined using the equation () ∑ ∑ − = − = − = 1 2 / 0 1 0 2 , 1) (r m k m qk j r p pq r r k r f e m r t T π , (a) (b) Figure 1: (a) A 10x10 pixel space subdivided into 5 …
منابع مشابه
Image analysis using moments
Moments of images provide efficient local descriptors and have been used extensively in image analysis applications. Their main advantage is their ability to provide invariant measures of shape. In this work, we present an overview of the most commonly used image moments, as well as a hardware architecture capable of fast calculation of geometric, Zernike and Tchebichef moments. Index Terms – I...
متن کاملImage Analysis by Tchebichef Moments
This paper introduces a new set of orthogonal moment functions based on the discrete Tchebichef polynomials. The Tchebichef moments can be effectively used as pattern features in the analysis of two-dimensional images. The implementation of moments proposed in this paper does not involve any numerical approximation, since the basis set is orthogonal in the discrete domain of the image coordinat...
متن کاملA comparative analysis of algorithms for fast computation of Zernike moments
This paper details a comparative analysis on time taken by the present and proposed methods to compute the Zernike moments, Zpq. The present method comprises of Direct, Belkasim’s, Prata’s, Kintner’s and Coe3cient methods. We propose a new technique, denoted as q-recursive method, speci5cally for fast computation of Zernike moments. It uses radial polynomials of 5xed order p with a varying inde...
متن کاملA New Class of Rotational Invariants Using Discrete Orthogonal Moments
This paper presents a new class of Tchebichef moments in polar coordinate form, using which rotational invariants can be easily constructed. The structure of the invariants is very similar to that of Zernike and Pseudo-Zernike moments, and their computation does not involve discrete approximation of continuous integral terms. The invariants are thus very robust in the presence of image noise, a...
متن کاملImproving Image Reconstruction Accuracy Using Discrete Orthonormal Moments
− Several pattern recognition applications use orthogonal moments to capture independent shape characteristics of an image, with minimum amount of information redundancy in a feature set. Legendre, Zernike, and Pseudo-Zernike moments are examples of such orthogonal feature descriptors. An image can also be reconstructed from a sufficiently large number of orthogonal moments. Discrete orthogonal...
متن کامل